Distributed localization of wireless sensor network using communication wheel

We study the network localization problem, i.e., problem of determining node positions a wireless sensor modeled as unit disk graph. In an arbitrarily deployed network, all nodes may not be uniquely determined. Computational complexity results suggest that even if corresponds to unique solution, polynomial-time algorithm is unlikely exist. So we are interested in algorithms efficiently localize partially. A widely used technique can localizable portion trilateration: starting from three anchors (nodes with known positions), having at least localized neighbors sequentially localized. However, performance trilateration substantially differ for different choices initial anchors. this paper, propose distributed scheme theoretical characterization guaranteed particular, our proposed starts strongly interior and provided subgraph induced by connected, it localizes except some boundary isolated weakly nodes.